LOT: A Robust Overlay for Distributed Range Query Processing
نویسندگان
چکیده
Large-scale data-centric services are often handled by clusters of computers that include hundreds of thousands of computing nodes. However, traditional distributed query processing techniques fail to handle the large-scale distribution, peer-to-peer communication and frequent disconnection. In this paper, we introduce LOT, a robust, fault-tolerant and highly distributed overlay network for large-scale peer-to-peer query processing. LOT is based on a robust tree overlay for distributed systems. It uses virtualization, replication, geographic-based clustering and flexible state definition as basic design principles. We show how we map these principles to desirable performance goals. Moreover, we provide a lightweight maintenance mechanism for updating state information. Analysis and simulations show that our approach is superior to other well-known alternatives in its query processing performance and handling of churn.
منابع مشابه
L-overlay: A layered data management scheme for peer-to-peer computing
Efficient storage and handling of data stored in a peer-to-peer (P2P) network, proves vital for various applications such as query processing and data mining. This paper presents a distributed, scalable and robust layered overlay (L-overlay) to index and manage multidimensional data in a dynamic P2P network. The proposed method distinguishes between the data and peer layers, with efficient mapp...
متن کاملDesign of Saturn Architecture Over DHT Data System
A large-scale network is one in which the automated network systems must be able to manage the network as a single entity rather than managing individual connections between networks. A large scale network consists of an overall architecture. An overlay architecture is used to improve internet routing and quality of service guarantees to achieve higher quality streaming media. The existing over...
متن کاملScalable Range Query Processing for Large-Scale Distributed Database Applications
Peer-to-peer (P2P) systems provide a robust, scalable and decentralized way to share and publish data. Although highly efficient, current P2P index structures based on Distributed Hash Tables (DHTs) provide only exact match data lookups. This compromises their use in database applications where more advanced query facilities, such as range queries, are a key requirement. In this paper, we give ...
متن کاملMultidimensional Range Query Processing in Structured P2P Overlays
The Multi-Ring Content Addressable Network (RCAN) [1] is a dynamic distributed index structure for efficient management of large multidimensional data sets over peer-to-peer systems. RCAN propose a new self-organizing overlay topology that achieves logarithmic routing performance and effective load balancing while minimizing the maintenance overhead during nodes join and departure. In this pape...
متن کاملEstimating the Completeness of Range Queries over Structured P2P Databases: Fundamentals, Theory and Effective Applications to Distributed Information Systems
Range queries are a very powerful tool in a wide range of data management systems and are vital to a multitude of applications. The hierarchy of structured overlay systems can be utilized in order to provide efficient techniques for processing them, resulting in the support of applications and techniques based on range queries in large-scale distributed information systems. On the other hand, d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006